منابع مشابه
Locating-dominating sets in twin-free graphs
A locating-dominating set a of graph G is a dominating set D of G with the additional property that every two distinct vertices outside D have distinct neighbors in D; that is, for distinct vertices u and v outside D, N(u) ∩D 6= N(v) ∩D where N(u) denotes the open neighborhood of u. A graph is twin-free if every two distinct vertices have distinct open and closed neighborhoods. The location-dom...
متن کاملIndependent dominating sets in triangle-free graphs
The independent domination number of a graph is the smallest cardinality of an independent set that dominates the graph. In this paper we consider the independent domination number of triangle-free graphs. We improve several of the known bounds as a function of the order and minimum degree, thereby answering conjectures of Haviland.
متن کاملMinimum Dominating Sets in Scale-Free Network Ensembles
We study the scaling behavior of the size of minimum dominating set (MDS) in scale-free networks, with respect to network size N and power-law exponent c, while keeping the average degree fixed. We study ensembles generated by three different network construction methods, and we use a greedy algorithm to approximate theMDS.With a structural cutoff imposed on themaximal degree kmax~ ffiffiffiffi...
متن کاملLocating-Total Dominating Sets in Twin-Free Graphs: a Conjecture
A total dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D. A locating-total dominating set of G is a total dominating set D of G with the additional property that every two distinct vertices outside D have distinct neighbors in D; that is, for distinct vertices u and v outside D, N(u) ∩D 6= N(v) ∩D where N(u) denotes the open neighborhood of...
متن کاملEfficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
Let G = (V,E) be a graph. A vertex dominates itself and all its neighbors, i.e., every vertex v ∈ V dominates its closed neighborhood N [v]. A vertex set D in G is an efficient dominating (e.d.) set for G if for every vertex v ∈ V , there is exactly one d ∈ D dominating v. An edge set M ⊆ E is an efficient edge dominating (e.e.d.) set for G if it is an efficient dominating set in the line graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Symbolic Logic
سال: 1999
ISSN: 0022-4812,1943-5886
DOI: 10.2307/2586752